Local Energy Fairing of B-spline Curves
نویسندگان
چکیده
An automatic algorithm for fairing B-spline curves of general order is presented. This work was motivated by a method of Farin and Sapidis about fairing planar cubic B-spline curves by subsequently removing and reinserting knots. Instead our new algorithm is based on the idea of subsequently changing one control point of a given B-spline curve so that the new curve minimizes the integral of the squared l-th derivative of the B-spline curve. How to proceed, if a tolerance is given and must be kept, is also discussed.
منابع مشابه
Fairing Spatial B-spline Curves
Three-dimensional curves are playing an increasing role in ship-hull modeling and many other areas of computer-aided design (CAD). The problem of evaluating and improving the fairness of such a curve is considered and three solutions (algorithms) are proposed representing all major methodologies currently pursued by CAD researchers: local fairing by knot removal, and local/global fairing based ...
متن کاملTarget Curvature Based Automatic Fairing of Planar B-Spline Curves
A new automatic local fairing technique for planar B-spline curves is presented in this paper. According to the design intent, a target curvature plot, which is provided by the designer, is used to identify ‘bad’ points and ‘bad’ curve segments. Then, the corresponding control points are modified in a process of local constrained optimization where the importance of fairness in the sense of ene...
متن کاملFast and Local Fairing of B-Spline Curves and Surfaces
The paper proposes a fast fairing algorithm for curves and surfaces. It rst de nes a base algorithm for fairing curves, which is then extended to the surface case, where the isocurves of the surface are faired. The curve fairing process involves the discrete integration of a pseudo-arc-length parameterization of B-spline curves, with a blending and tting phase concluding the algorithm. In the c...
متن کاملLocal Energy Fairing of B{Spline Surfaces
An algorithm for local fairing of B-spline surfaces of arbitrary order is presented. This stepwise algorithm is based on the idea of changing only one control point in each iteration step. Which point has to be changed is determined by a ranking-list where all control points are sorted in regard to their corresponding values of a suitable chosen fairness criterion. The criterion is chosen in su...
متن کاملModélisation géométrique de surfaces lisses: Design et Fairing. (Geometric modeling of smooth surfaces: Design and Fairing)
A piecewise quintic G1 spline surface interpolating the vertices of a triangular surface mesh of arbitrary topological type is presented. The surface has an explicit triangular Bézier representation, is affine invariant and has local support. The twist compatibility problem which arises when joining an even number of polynomial patches G1 continuously around a common vertex is solved by constru...
متن کامل